Schulze and ranked-pairs voting are fixed-parameter tractable to bribe, manipulate, and control
نویسندگان
چکیده
منابع مشابه
Schulze and Ranked - Pairs Voting Are Fixed - Parameter
Schulze and ranked-pairs elections have received attention recently, with the former having quickly become a widely used election system. For many cases these systems have been proven resistant to bribery, control, and manipulation, with ranked pairs being particularly praised for being NPhard for all three of those. Nonetheless, this work shows that with respect to the number of candidates, bo...
متن کاملControl Complexity of Schulze Voting
Schulze voting is a recently introduced voting system enjoying unusual popularity and a high degree of real-world use, with users including the Wikimedia foundation, several branches of the Pirate Party, and MTV. It is a Condorcet voting system that determines the winners of an election using information about paths in a graph representation of the election. We resolve the complexity of many el...
متن کاملManipulation and Control Complexity of Schulze Voting
Schulze voting is a recently introduced voting system enjoying unusual popularity and a high degree of real-world use, with users including the Wikimedia foundation, several branches of the Pirate Party, and MTV. It is a Condorcet voting system that determines the winners of an election using information about paths in a graph representation of the election. We resolve the complexity of many el...
متن کاملFixed-Parameter Tractable Reductions to SAT
Today’s SAT solvers have an enormous importance and impact in many practical settings. They are used as efficient back-end to solve many NP-complete problems. However, many computational problems are located at the second level of the Polynomial Hierarchy or even higher, and hence polynomial-time transformations to SAT are not possible, unless the hierarchy collapses. In certain cases one can b...
متن کاملImbalance Is Fixed Parameter Tractable
In the Imbalance Minimization problem we are given a graph G = (V,E) and an integer b and asked whether there is an ordering v1 . . . vn of V such that the sum of the imbalance of all the vertices is at most b. The imbalance of a vertex vi is the absolute value of the difference between the number of neighbors to the left and right of vi. The problem is also known as the Balanced Vertex Orderin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Mathematics and Artificial Intelligence
سال: 2015
ISSN: 1012-2443,1573-7470
DOI: 10.1007/s10472-015-9479-1